Auflistung nach Schlagwort "Boolean functions"

Sortiert nach: Sortierung: Ergebnisse:

  • The complexity of generalized satisfiability for linear temporal logic 
    Bauland, Michael; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert (Braunschweig : International Federation for Computational Logic, 2009)
    In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set ...
  • A contact detection algorithm for superellipsoids based on the common-normal concept 
    Wellmann, Christian; Lillie, Claudia; Wriggers, Peter (Bingley : Emerald Group Publishing Ltd., 2008)
    Purpose - The paper aims to introduce an efficient contact detection algorithm for smooth convex particles. Design/methodology/approach - The contact points of adjacent particles are defined according to the common-normal ...
  • On quantified propositional logics and the exponential time hierarchy 
    Hannula, Miika; Kontinen, Juha; Lück, Martin; Virtema, Jonni (Waterloo, NSW : Open Publishing Association, 2016)
    We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified ...
  • On the number of iterations required by von Neumann addition 
    Grübel, Rudolf; Reimers, Anke (Cambridge : Cambridge University Press, 2001)
    We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the input is random. Several authors have obtained results on the average case behaviour, mainly using analytic techniques based ...
  • Parametrised complexity of satisfiability in temporal logic 
    Lück, Martin; Meier, Arne; Schindler, Irena (Association for Computing Machinery, 2017)
    We apply the concept of formula treewidth and pathwidth to computation tree logic, linear temporal logic, and the full branching time logic. Several representations of formulas as graphlike structures are discussed, and ...